Yet Another Formalism for Morphological Paradigm
نویسنده
چکیده
Morphology is one of the few areas in the natural language processing where computers are good enough. Different approaches lead to different problems. For Slavonic languages rules and statistical methods are commonly used. Rule based methods are more precise but tend to fail when parsing unknown words. Hybrid technologies with statistical methods helps to solve this problem. It is also possible to solve this problem by extending existing rule-based resources. These resources can be used also for other linguistic research. This paper presents new formalism which is closer to human understanding of natural language morphology and its application in extending morphological dictionary.
منابع مشابه
Yet Another Map Algebra
This paper describes features of a language approach for map algebra based on the use of algebraic expressions that satisfy a concise formalism. To be consistent with formal approaches such as geoalgebra and image algebra, the proposed algebraic expressions are suitable not only for the usual modeling of layers but also to describe variable neighborhoods and zones. As a compromise between langu...
متن کاملYet Another Efficient Unification Algorithm
The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [4] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.
متن کاملParadigm classification in supervised learning of morphology
Supervised morphological paradigm learning by identifying and aligning the longest common subsequence found in inflection tables has recently been proposed as a simple yet competitive way to induce morphological patterns. We combine this non-probabilistic strategy of inflection table generalization with a discriminative classifier to permit the reconstruction of complete inflection tables of un...
متن کاملA matrix approach to polynomials
We present a matrix formalism to study univariate polynomials. The structure of this formalism is beautiful enough to be worth seeing on its own, yet we give (another) motivation to this by presenting three new theorems and applying the formalism to give new proofs of some known results. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 11C08; 15A36; 11B68; 11B73
متن کاملA Methodology for Anonymity Control in Electronic Services Using Credentials
The organization of all kinds of personal and business affairs is being digitized. At the same time, the Internet is gaining importance as a basic communication mechanism, which opens up a lot of these digitized processes to outsiders. The correct operation of these applications is fundamental and security/control is more than ever a crucial concern. Yet today, the identity and on-line behavior...
متن کامل